A local-search based heuristic for the unrestricted block relocation problem
نویسندگان
چکیده
منابع مشابه
Heuristic Methods for the Unrestricted Dynamic Container Relocation Problem
In this work, we address the unrestricted Dynamic Container Relocation Problem (DCRP). The DCRP is an extension of the Container Relocation Problem (CRP) that is NPhard. The CRP aims to empty a single yard-bay, which contains containers with a given retrieval sequence from the yardbay, such that the total number of relocations is minimized. The DCRP extends the CRP so that containers both arriv...
متن کاملa meta-heuristic approach to cvrp problem: local search optimization based on ga and ant colony
the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...
متن کاملA competitive local search heuristic for the subset sum problem
Subset sum problems are a special class of diicult singly constrained zero-one integer programming problems. Several heuristics for solving these problems have been reported in the literature. In this paper we propose a new heuristic based on local search which improves upon the previous best.
متن کاملA Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem
T paper presents a binary search heuristic algorithm for the rectangular strip-packing problem. The problem is to pack a number of rectangles into a sheet of given width and infinite height so as to minimize the required height. We first transform this optimization problem into a decision problem. A least-waste-first strategy and a minimal-inflexion-first strategy are proposed to solve the rela...
متن کاملA chain heuristic for the Blocks Relocation Problem
Article history: Received 8 January 2013 Received in revised form 13 June 2014 Accepted 14 June 2014 Available online 23 June 2014
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2019
ISSN: 0305-0548
DOI: 10.1016/j.cor.2019.04.006